Complete delete vs. time machine computing

Complete Computing

Our objective is to enable nomadic and mobile computing, as well as telecommuting, small-ooce, and branch-ooce computing. These areas have been dealt with extensively in the literature. However, they have been treated as separate problem spaces and current solutions focus on solving speciic problems in one area while ignoring { or even exacerbating { those in another area. These problem spaces ...

Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals

This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook’s scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are...

Real-time Hierarchical Visual Tracking Using a Configurable Computing Machine

This paper describes a custom computing approach to real-time visual tracking. Traditionally, tracking systems require dedicated hardware to accommodate the computational demands and input/output rates imposed by real-time video sources. A radical alternative is represented by custom computing machines such as Splash 2, which use interconnected Field-Programmable Gate Arrays (FPGAs) to provide ...

Beyond Cloud Computing: Towards Complete Computing

Introduction The DoA of HOLACloud included a roadmap associated with CF2016 – the Cloud Forward 2016 Conference. The project proposed and agreed to run the CF2015 conference (a) to increase the relevance of the proposed research directions of the Beyond Cloud Community; (b) to provide input to the EC from the community (focused through HOLACloud) on “Beyond CLOUD Computing” or “Complete Computi...

On Delete Cascade